Generation and circuit implementation of multi-block multidirectional grid multi-scroll chaotic attractors

Due to the dynamic characteristics of the Chua's system, multi-scroll chaotic attractors are still confined in a single block and fail to break the limit. This paper proposes an approach for generating novel multi-block multidirectional grid multi-scroll chaotic attractors that can break the limit via novel nonlinear modulating functions. According to this method, the recursion rules used to generate multi-block multidirectional grid multi-scroll attractors are mathematically obtained. The new system is autonomous; the effectiveness of this method has been verified by theoretical analysis, numerical simulation, and circuit implementation.     

NORMAL GRID RULE FOR HYPERSONIC HEAT FLUX NUMERICAL SIMULATION

采用数值求解雷诺平均Navier-Stokes 方程方法对高超声速钝双锥模型进行了计算,比较了不同法向网格尺度对热流计算的影响,并在此基础上提出了一种适于热流计算的网格准则. 研究表明:在实际外形的热流计算中,使用过密或过粗的法向网格均不利于得到准确的热流数据;采用该文提出的基于当地温度梯度的法向网格尺度准则可以在保证热流计算精度的同时实现较高的收敛速度.     

Interpolation of Scattered 3D PTV Data to a Regular Grid

The velocity data obtained by many 3D measurement methods such as particle tracking velocimetry (PTV) are not regularly distributed in3D space. We revised three numerical schemes to interpolate the scattered velocity vectors to a regularly spaced grid. Additionally, two techniques were examined to smooth the resulting flow field. The different algorithms were tested for a synthetic data set based on the analytical solution of Burgers' vortex. To study the impact of measurement errors a Gaussian noise was superimposed on the exact solution. It was found that an interpolation scheme of higher order does not necessarily perform better than one of lower order. The most‘robust’ algorithm was used to process 3D PTV data, which were obtained from measurements of a separating flow in a forward facing step configuration. Information on the 3D streamlines and vortex structures was obtained. This revised version was published online in July 2006 with corrections to the Cover Date.     

A note on finite difference discretizations for Poisson equation on a disk

A simple second‐order finite difference treatment of polar coordinate singularity for Poisson equation on a disk is presented. By manipulating the grid point locations, we can successfully avoid finding numerical boundary condition at the origin so that the resulting matrix is simpler than traditional schemes. The treatments for Dirichlet and Neumann boundary problems are slightly different by adjusting the radial mesh width. Furthermore, the present discretization can be applied with slight modifications to Helmholtz‐type equations. The numerical evidence shows that the second‐order accuracy can also be preserved. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 199–203, 2001     

微束斑X射线源发射系统的数值计算

本文采用边界元法(BEM)对高亮度微束斑X射线源的LaB₆阴极、Wehnet栅极和阳极等发射系统的电位和场强分布进行了数值计算,首先计算了系统对称轴上的电位,再利用三次样条插值法和谢赫尔公式等计算了系统在考虑三次相差情况下的傍轴电场强度分布.     

稳定分层二层流室内实验早期格栅湍流结构

采用室内实验混合箱和粒子图像测速技术,本文研究了稳定分层无平均剪切二层流(上层淡水、下层盐水)振动湍流结构。对实验录像进行粒子图像测速技术处理,获得垂向二维流场(垂直于格栅平面)瞬时速度和涡量,并用于计算:①时均速度和时均涡量;②均方根速度;③均匀程度和各向同性程度;④平均流强度;⑤时均泰勒的欧拉积分长度尺度;⑥时均湍动能和时均湍动能垂向通量;⑦水平和垂向速度的欧拉频谱。结果显示:(1)格栅方棒处时间平均速度方向垂直向上,而其两侧的时间平均涡量正负交替,表明格栅附近射流结构占据主要位置且存在反向涡旋对。(2)均方根速度随着距离格栅(水平面)高程的增大而减小,并且满足高程的-1.425(接近-3/2)幂次律,表明格栅湍流均方根速度的垂向变化较为剧烈。(3)靠近混合箱边壁处的均匀程度和各向同性程度都大于1,表明靠近混合箱边壁处存在各向异性湍流。(4)格栅反湍流强度的量级非0,但是,相对较小,表明平均流强度较低,故而,本实验结果仍可与无平均流的情况作对比。(5)时均泰勒的欧拉积分长度尺度随着距离格栅(水平面)高程的增大而线性增大,表明随着湍流向上发展,涡的平均尺度增大。(6)时均湍动能和时均湍动能垂向通量随着距离格栅(水平面)高程的增大而减小,而时均湍动能垂向通量为正值,表明远离格栅时均湍动能衰减,但是,始终向上传递。(7)水平和垂向速度的欧拉频谱随着距离格栅(水平面)高程的增大而减小,幂次律介于ω^-1和ω^-5/3(ω为频率)之间,表明水平和垂向的湍流脉动能量远离格栅均衰减,并受湍流的有限雷诺数效应的影响。     

谱体积方法单元分割与问题单元标记方法的改进研究

谱体积方法是一种本质上解决网格依赖性的高精度CFD计算方法,本文研究了二维Euler方程的谱体积方法,提出一种基于切比雪夫多项式的单元分割方法,建立了基于WENO的变量限制器方法,并发展了结合谱体积和控制体的问题单元标记方法.采用15°超声速压缩拐角和NACA0012跨声速流动两个典型算例进行验证,结果表明,该分区方法具有更好的计算精度,标记方法可有效识别不连续区域,在较少的网格下即可获得与密网格传统有限体积法相当的计算精度.     

Rich-club network topology to minimize synchronization cost due to phase difference among frequency-synchronized oscillators

As exemplified by power grids and large-scale brain networks, some functions of networks consisting of phase oscillators rely on not only frequency synchronization, but also phase synchronization among the oscillators. Nevertheless, even after the oscillators reach frequency-synchronized status, the phase synchronization is not always accomplished because the phase difference among the oscillators is often trapped at non-zero constant values. Such phase difference potentially results in inefficient transfer of power or information among the oscillators, and avoids proper and efficient functioning of the networks. In the present study, we newly define synchronization cost by using the phase difference among the frequency-synchronized oscillators, and investigate the optimal network structure with the minimum synchronization cost through rewiring-based optimization. By using the Kuramoto model, we demonstrate that the cost is minimized in a network with a rich-club topology, which comprises the densely-connected center nodes and low-degree peripheral nodes connecting with the center module. We also show that the network topology is characterized by its bimodal degree distribution, which is quantified by Wolfson’s polarization index.     

Effect of Discharge Plasma Potential on Diffusion Plasma Parameters Controlled by a Mesh Grid in a Double Plasma Device

The plasma region under investigation is separated from the discharge region by a mesh grid. Plasma potential and electron number densities and electron temperatures under bi‐Maxwellian approximation for electron distribution function of the multi‐dipole argon plasma are measured. The cold electrons in the diffusion region are produced by local ionization. The hot electrons are the ionizing electrons behaving as Maxwellian. The electron trapping process in the discharge region is produced by potential well due to positive plasma potential with respect to the anode and by a repulsive grid. The dependence of ratios of the density of the hot to the cold electrons N_E (=N_eh/N_ec) and hot to cold electron temperature T(=T_eh/T_ec) in the diffusion region on the depth of the potential well has been investigated. (© 2013 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Space-filling curves for 2-simplicial meshes created with bisections and reflections

Numerical experiments in J. Maubach: Local bisection refinement and optimal order algebraic multilevel preconditioners, PRISM-97 conference Proceedings, 1977, 121–136 indicated that the refinement with the use of local bisections presented in J. Maubach: Local bisection refinement for n-simplicial grids generated by reflections, SIAM J. Sci. Comput. 16 (1995), 210–227 leads to highly locally refined computational 2-meshes which can be very efficiently load-balanced with the use of a space-filling curve. This paper introduces the construction of this curve which can be produced at almost no costs, proofs that all its properties are invariant under local bisection, and comments on the 3-dimensional case.With the use of a space-filling curve (which passes through all triangular elements), load balancing over several processors is trivial: The load can be distributed over N processors by cutting the curve into N almost equilength parts. Each processor then operates on the triangles which are passed by its part of the curve.